An Interactive Visualization Framework for Time%2DSeries of Web Graphs in a 3D Environment.

Identifying spam link generators for monitoring emerging web spam.

Detecting Hijacked Sites by Web Spammer Using Link%2DBased Algorithms.

Detecting Link Hijacking by Web Spammers.

Mining and Visualizing the Evolution of the Web Graph Structure.

Socio%2DSense A System for Analysing the Societal Behavior from Long Term Web Archive.


Characterization of the Thai hostgraph.


IdentifyingWeb Spam by Densely Connected Sites and its Statistics in a JapaneseWeb Snapshot.

What%27s really new on the web%3F identifying new pages from a series of unstable web snapshots.
Identifying and tracking new information on the Web is important in sociology, marketing, and survey research, since new trends might be apparent in the new information. Such changes can be observed by crawling the Web periodically. In practice, however, it is impossible to crawl the entire expanding Web repeatedly. This means that the novelty of a page remains unknown, even if that page did not exist in previous snapshots. In this paper, we propose a novelty measure for estimating the certainty that a newly crawled page appeared between the previous and current crawls. Using this novelty measure, new pages can be extracted from a series of unstable snapshots for further analysis and mining to identify new trends on the Web. We evaluated the precision, recall, and miss rate of the novelty measure using our Japanese web archive, and applied it to a Web archive search engine.
Mining Communities on the Web Using a Max%2DFlow and a Site%2DOriented Framework.

A system for visualizing and analyzing the evolution of the web with a time series of graphs.
We propose WebRelievo, a system for visualizing and analyzing the evolution of the web structure based on a large Web archive with a series of snapshots. It visualizes the evolution with a time series of graphs, in which nodes are web pages, and edges are relationships between pages. Graphs can be clustered to show the overview of changes in graphs. WebRelievo aligns these graphs according to their time, and automatically determines their layout keeping positions of nodes synchronized over time, so that the user can keep track pages and clusters. This visualization enables us to understand when pages appeared, how their relationships have evolved, and how clusters are merged and split over time. Current implementation of WebRelievo is based on six Japanese web archives crawled from 1999 to 2003. The user can interactively browse those graphs by changing the focused page and by changing layouts of graphs. Using WebRelievo we can answer historical questions, and to investigate changes in trends on the Web. We show the feasibility of WebRelievo by applying it to tracking trends in P2P systems and search engines for mobile phones, and to investigating link spamming.
Mining Communities on the Web Using a Max%2DFlow and a Site%2DOriented Framework.

Extracting User Behavior by Web Communities Technology on Global Web Logs.
Abstract. A lot of work has been done on extracting the model of web user behavior. Most of them target server-side logs that cannot track user behavior outside of the server. Recently, a novel way has been developed to collect web browsing histories, using the same method for determining TV audience ratings; i.e., by collecting data from randomly selected users called panels. The logs collected from panels(called panel logs) cover an extremely broad URL-space, and it is difficult to capture the global behaviors of the users. Here we utilize mining results of web community to group those URLs into easily understandable topics. We
Visualization of Global Web Log and Web Communities.

Finding Neighbor Communities in the Web Using Inter%2Dsite Graph.
In recent years, link-based information retrieval methods  from the Web are developed. A framework of these methods is a Web  graph using pages as vertices and Web-links as edges. In the last year,  the authors have claimed that an inter-site graph using sites as vertices  and global-links (links between sites) as edges is more natural and useful  as a framework for link-based information retrieval than a Web graph.
Extracting evolution of web communities from a series of web archives.
store a series of large Web archives. It is now an exciting challenge for us to observe evolution of the Web. In this paper, we propose a method for observing evolution of web communities. A web community is a set of web pages created by individuals or associations with a common interest on a topic. So far, various link analysis techniques have been developed to extract web communities. We analyze evolution of web communities by comparing four Japanese web archives crawled from 1999 to 2002. Statistics of these archives and community evolution are examined, and the global behavior of evolution is described. Several metrics are introduced to measure the degree of web community evolution, such as growth rate, novelty, and stability. We developed a system for extracting detailed evolution of communities using these metrics. It allows us to understand when and how communities emerged and evolved. Some evolution examples are shown using our system.
Compact Encoding of the Web Graph Exploiting Various Power Laws Statistical Reason Behind Link Database.

Analyzing Global Behavior of Web Community Evolution.

WEB Community Mining and WEB Log Mining Commodity Cluster Based Execution.
The emergence of WWW has drawn new frontiers for database research. Web mining has become a hot topic since WWW rapid expansion rate and chaotic nature have exposed some technical challenges as well as interesting discoveries. In general web mining can be classified into web structure mining and web usage mining. Here we introduce two applications of web mining, first from mining the web structure we identify web communities, and the second we mine web usage of mobile internet users on location aware search engine. Those applications require heavy computational power as well as good scalability. Cluster of commodity PCs is suitable as the platform to handle such applications. Here we also report some approaches for optimal parallel execution of mining algorithms on PC cluster.
Some Experiences on Large Scale Web Mining.

Static Visualization of Dynamic Data Flow Visual Program Execution.
We propose ‘Trace View’, a static visualization method for monitoring and debugging the dynamic behavior of programs written in data flow visual programming languages. Trace View presents a hierarchical structure of the data flow between nodes that is created over the execution time of the program. The view also serves as an interface that allows the programmer to select a data stream link when data must be examined during debugging. Moreover, since visualization grows in size according to the life time of the program, we have developed techniques to scale the view using a multi-focus focus+context view. 1.
Focusing on Sites in the Web.

Static Visualization of Dynamic Data Flow Visual Program Execution.
We propose ‘Trace View’, a static visualization method for monitoring and debugging the dynamic behavior of programs written in data flow visual programming languages. Trace View presents a hierarchical structure of the data flow between nodes that is created over the execution time of the program. The view also serves as an interface that allows the programmer to select a data stream link when data must be examined during debugging. Moreover, since visualization grows in size according to the life time of the program, we have developed techniques to scale the view using a multi-focus focus+context view. 1.
Scalable and Comprehensible Visualization for Discovery of Knowledge from the Internet.

Web%2DLinkage Viewer Finding Graph Structures in the Web.

Applying the Site Information to the Information Retrieval from the Web.
In recent years, several information retrieval methods using information about the Web-links are developed, such as HITS and Trawling. In order to analyze the Web-links dividing into links inside each Web site (local-links) and links between Web sites (global-links) for the information retrieval, it is required that a proper model of the Web site, a phrase used ambiguously in daily life. In the existing researches, a Web server is used as a model of the Web site. This idea works relatively well in case that a Web site corresponds to a server such as public Web sites, but works poorly in case that multiple Web sites correspond to a server such as private Web sites on rental Web servers. In this paper, we propose a new model of the Web site, &#034;directorybased site&#034; to handle typical private sites, and a method to identify them using information about the URL and the Web-links. We verify the method can approximately identify about ### of over 110 thousands servers whether each server has multiple directory-based sites or not, and extract over 500 thousands of directory-based sites and 4 million global-links by computational experiments using jp- domain URLs and Web-links data contains over 23 million URLs and 100 million Web-links, collected from July to August 2000, by Toyoda and Kitsuregawa. We also propose a new framework of the Web-links based information retrieval that uses the directory-based sites and the globallinks instead of the Web pages and the whole Web-links respectively, and examine effectiveness of our framework by comparing a result of Trawling on our framework to one on the existing framework.
Creating a Web community chart for navigating related communities.
numerous web communities on the Web. A web community is a collection of web pages created by individuals or any kind of associations that have a common interest on a specific topic. In this paper, we propose a technique to create a web community chart, that connects related web communities, from thousands of seed pages. This allows the user to navigate through related web communities, and can be used for a `What&#039;s Related Community&#039; service that provides not only the web community including a given page but also related web communities. Our technique is based on a related page algorithm that gives related pages to a given page using only link analysis. We show that the algorithm can be used for creating the chart by applying the algorithm to each seed, then using similarities of the results to classify seeds into clusters and to deduce their relationships. We perform experiments to create a web community chart of companies and organizations from thousands of seed pages. First, we improve the precision of an existing related page algorithm, Companion, and evaluated the improved version, Companion--, by an user study. Then the chart is created using Companion--. The result chart consists of web communities including related pages, and paths between related web communities. From the chart, we can find many web communities of companies classified by their category of business, and relationships between the communities.
A Web Community Chart for Navigating Related Communities.
numerous web communities on the Web. A web community is a collection of web pages created by individuals or any kind of associations that have a common interest on a specific topic. In this paper, we propose a technique to create a web community chart, that connects related web communities, from thousands of seed pages. This allows the user to navigate through related web communities, and can be used for a `What&#039;s Related Community&#039; service that provides not only the web community including a given page but also related web communities. Our technique is based on a related page algorithm that gives related pages to a given page using only link analysis. We show that the algorithm can be used for creating the chart by applying the algorithm to each seed, then using similarities of the results to classify seeds into clusters and to deduce their relationships. We perform experiments to create a web community chart of companies and organizations from thousands of seed pages. First, we improve the precision of an existing related page algorithm, Companion, and evaluated the improved version, Companion--, by an user study. Then the chart is created using Companion--. The result chart consists of web communities including related pages, and paths between related web communities. From the chart, we can find many web communities of companies classified by their category of business, and relationships between the communities.
Hyper Mochi Sheet A Predictive Focusing Interface for Navigating and Editing Nested Networks Through a Multi%2DFocus Distortion%2DOriented View.

Supporting Design Patterns in a Visual Parallel Data%2Dflow Programming Environment.
We propose the notion of visual design pattern  (VDP), which is a visual abstraction representing design aspects in parallel data-flow programs. VDP serves as a flexible and high-level structure of reuse for visual parallel programming. We introduced the support for this notion into the visual parallel programming environment, KLIEG, allowing definition and use of patterns with simple and easy interface.  1 Introduction  Design pattern approaches have been recently proposed to describe recurring design aspects in objectoriented systems for enhancing software reusability. A design pattern is a document that describes the combination technique of abstract objects using diagrams, descriptions, and example programs. Catalogs of design patterns such as [3] have been published; with these catalogs, non-expert programmers can use welldesigned combination techniques, and can construct reusable software by implementing abstract objects depicted by the patterns. Design pattern approaches are als...
